The Contraction Method for Counting the Complexity of Planar Graphs with Cut Vertices
نویسندگان
چکیده
In this paper, we investigate the number of spanning trees in planar graphs with two cut vertices. We propose a combinatorial approach based on the contraction method, in order to derive spanning trees recursions for this class of graphs. Applications on different graphs showed the efficiency and the simplicity of our recursive approach in comparison with the classic matrix tree theorem. Mathematics Subject Classification: 05C85, 05C30
منابع مشابه
Counting Matchings with k Unmatched Vertices in Planar Graphs
We consider the problem of counting matchings in planar graphs. While perfect matchings in planar graphs can be counted by a classical polynomial-time algorithm [26, 33, 27], the problem of counting all matchings (possibly containing unmatched vertices, also known as defects) is known to be #P-complete on planar graphs [23]. To interpolate between the hard case of counting matchings and the eas...
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملSurface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces
The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P . The restriction of this problem to planar graphs has often been considered. After a sequence of improvements, the current best algorithm for planar graphs is a linear time algorithm by Dorn (STACS ’10), with complexity 2O(k) ·O(n). We gen...
متن کاملOn the variable sum exdeg index and cut edges of graphs
The variable sum exdeg index of a graph G is defined as $SEI_a(G)=sum_{uin V(G)}d_G(u)a^{d_G(u)}$, where $aneq 1$ is a positive real number, du(u) is the degree of a vertex u ∈ V (G). In this paper, we characterize the graphs with the extremum variable sum exdeg index among all the graphs having a fixed number of vertices and cut edges, for every a>1.
متن کاملComputing Branch Decomposition of Large Planar Graphs
A graph of small branchwidth admits efficient dynamic programming algorithms for many NP-hard problems on the graph. A key step in these algorithms is to find a branch decomposition of small width for the graph. Given a planar graph G of n vertices, an optimal branch decomposition of G can be computed in polynomial time, e.g., by the edge-contraction method in O(n) time. All known algorithms fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013